Improved instance generation for kidney exchange programmes
نویسندگان
چکیده
Kidney exchange programmes increase the rate of living donor kidney transplants, and operations research techniques are vital to such programmes. These techniques, as well changes policy regarding programmes, often tested using random instances created by a Saidman generator. We show that produced generator differ from real-world across number important parameters, including average recipients compatible with certain donor. exploit these differences devise powerful upper lower bounds we demonstrate their effectiveness optimally solving benchmark set in seconds; this could not be solved under thirty minutes previous algorithms. then present new for generating far more consistent UK programme. This process provides accurate base comparisons algorithms models, gives policy-makers better understanding potential leading an improved decision-making process.
منابع مشابه
Wavelet Based Exchange Rate Forecasting with Improved Instance Based Learning
In this paper we present a novel wavelet based exchange rate forecast model integrating wavelet filters for denoising and Improved Instance Based Learning(IIBL) approach. The proposed model implements a novel technique that extends the nearest neighbor algorithm to include the concept of pattern matching so as to identify similar instances thus implementing a nonparametric regression approach.T...
متن کاملPaired exchange programmes can expand the live kidney donor pool.
BACKGROUND Kidney paired donation (KPD) is an exchange of organs between two live donors, who are otherwise ABO incompatible or cross-match positive, and their intended recipients. The outcome is the generation of compatible transplants conferring an improvement in quality of life and longevity. METHODS Medline was searched for articles on KPD using a combination of keywords. Publications foc...
متن کاملAn Improved 2-Agent Kidney Exchange Mechanism
We study a mechanism design version of matching computation in graphs that models the game played by hospitals participating in pairwise kidney exchange programs. We present a new randomized matching mechanism for two agents which is truthful in expectation and has an approximation ratio of 3/2 to the maximum cardinality matching. This is an improvement over a recent upper bound of 2 [Ashlagi e...
متن کاملHard instance generation for SAT
We consider the problem of generating hard instances for the Satisfying Assignment Search Problem (in short, SAT). It is not known whether SAT is difficult on average, while it has been believed that the Factorization Problem (in short, FACT) is hard on average. Thus, one can expect to generate hard-on-average instances by using a reduction from FACT to SAT. Although the asymptotically best red...
متن کاملHard Instance Generation for Sat Title: Hard Instance Generation for Sat
We consider the problem of generating hard instances for the Satisfying Assignment Search Problem (in short, SAT). It is not known whether SAT is di cult on average, while it has been believed that the Factorization Problem (in short, FACT) is hard on average. Thus, one can expect to generate hard-on-average instances by using a reduction from FACT to SAT. Although the asymptotically best reduc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Operations Research
سال: 2022
ISSN: ['0305-0548', '1873-765X']
DOI: https://doi.org/10.1016/j.cor.2022.105707